Lecture Notes on Sorting
نویسنده
چکیده
We begin this lecture by discussing how to compare running times of functions in an abstract, mathematical way. The same underlying mathematics can be used for other purposes, like comparing memory consumption or the amount of parellism permitted by an algorithm. We then use this to take a first look at sorting algorithms, of which there are many. In this lecture it will be selection sort because of its simplicity. In terms of our learning goals, we will work on:
منابع مشابه
Lecture Notes on Parallel Scientific Computing
3 Model-based Programming Methods 10 3.1 Embarrassingly Parallel Computations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.1.1 Geometrical Transformations of Images . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.1.2 Mandelbrot Set . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 3.1.3 Monte Carlo Met...
متن کاملFactors affecting students tendency of Univercity students to Lecture Notes
Introduction: Many studies detected factors contributing to the students’ tendency to lecture notes. This study aimed at evaluating the factors affecting students tendency to lecture notes in Hormozgan University of Medical Sciences. Methods: In this descriptive study, 179 students from medicine, nursing & midwifery, health, and Paramedicine schools were selected through stratified random...
متن کاملLecture Notes on Tries
In the data structures implementing associative arrays so far, we have needed either an equality operation and a hash function, or a comparison operator with a total order on keys. Similarly, our sorting algorithms just used a total order on keys and worked by comparisons of keys. We obtain a different class of representations and algorithms if we analyze the structure of keys and decompose the...
متن کاملLecture Notes on Quicksort
In this lecture we consider two related algorithms for sorting that achieve a much better running time than the selection sort from last lecture: mergesort and quicksort. We developed quicksort and its invariants in detail. As usual, contracts and loop invariants will bridge the gap between the abstract idea of the algorithm and its implementation. We will revisit many of the computational thin...
متن کاملA Minicourse on Multithreaded Programming
These notes contain two lectures that teach multithreaded algorithms using a Cilk like model These lectures were designed for the latter part of the MIT undergraduate class Introduction to Algorithms The style of the lecture notes follows that of the textbook by Cormen Leiserson and Rivest but the pseudocode from that textbook has been Cilki ed to allow it to describe multithreaded algo rithms ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010